The surprising complexity of generalized reachability games
نویسندگان
چکیده
Games on graphs provide a natural and powerful model for reactive systems. In this paper, we consider generalized reachability objectives, defined as conjunctions of reachability objectives. We first prove that deciding the winner in such games is PSPACE-complete, although it is fixed-parameter tractable with the number of reachability objectives as parameter. Moreover, we consider the memory requirements for both players and give matching upper and lower bounds on the size of winning strategies. In order to allow more efficient algorithms, we consider subclasses of generalized reachability games. We show that bounding the size of the reachability sets gives two natural subclasses where deciding the winner can be done efficiently.
منابع مشابه
The surprizing complexity of generalized reachability games
Games on graphs provide a natural and powerful model for reactive systems. In this paper, we consider generalized reachability objectives, defined as conjunctions of reachability objectives. We first prove that deciding the winner in such games is PSPACE-complete, although it is fixed-parameter tractable with the number of reachability objectives as parameter. Moreover, we consider the memory r...
متن کاملOn the Complexity of Counter Reachability Games
Counter reachability games are played by two players on a graph with labelled edges. Each move consists in picking an edge from the current location and adding its label to a counter vector. The objective is to reach a given counter value in a given location. We distinguish three semantics for counter reachability games, according to what happens when a counter value would become negative: the ...
متن کاملReachability Switching Games
In this paper, we study the problem of deciding the winner of reachability switching games. These games provide deterministic analogues of Markovian systems. We study zero-, one-, and two-player variants of these games. We show that the zero-player case is NL-hard, the one-player case is NP-complete, and that the two-player case is PSPACE-hard and in EXPTIME. In the oneand two-player cases, the...
متن کاملLinear Equations with Ordered Data
Following a recently considered generalization of linear equations to unordered data vectors, we perform a further generalization to ordered data vectors. These generalized equations naturally appear in the analysis of vector addition systems (or Petri nets) extended with ordered data. We show that nonnegative-integer solvability of linear equations is computationally equivalent (up to an expon...
متن کاملMaximal elements of $mathscr{F}_{C,theta}$-majorized mappings and applications to generalized games
In the paper, some new existence theorems of maximal elements for $mathscr{F}_{C,theta}$-mappings and $mathscr{F}_{C,theta}$-majorized mappings are established. As applications, some new existence theorems of equilibrium points for one-person games, qualitative games and generalized games are obtained. Our results unify and generalize most known results in recent literature.
متن کامل